Hypercube Embeddings and Designs
نویسندگان
چکیده
This is a survey on hypercube embeddable semimetrics and the link with designs. We investigate, in particular, the variety of hypercube embeddings of the equidistant metric. For some parameters, it is linked with the question of existence of projective planes or Hadamard matrices. The problem of testing whether a semimetric is hyper-cube embeddable is NP-hard in general. Several classes of semimetrics are described for which this problem can be solved in polynomial time. We also consider questions related to some necessary conditions for hypercube embeddability.
منابع مشابه
Embedding ladders and caterpillars into the hypercube
We present embeddings of generalized ladders as subgraphs into the hypercube. By embedding caterpillars into ladders, we obtain embeddings of caterpillars into the hypercube. In this way we obtain almost all known results concerning the embeddings of caterpillars into the hypercube. In addition we construct embeddings for some new types of caterpillars.
متن کاملEmbedding Ladders and Caterpillars into
We present embeddings of generalized ladders as subgraphs into the hypercube. By embedding caterpillars into ladders, we obtain embeddings of caterpillars into the hypercube. In this way we obtain almost all known results concerning the em-beddings of caterpillars into the hypercube. In addition we construct embeddings for some new types of caterpillars.
متن کاملOptimal orthogonal-array-based latin hypercubes
The use of optimal orthogonal array latin hypercube designs is proposed. Orthogonal arrays were proposed for constructing latin hypercube designs by Tang (1993). Such designs generally have better space filling properties than random latin hypercube designs. Even so, these designs do not necessarily fill the space particularly well. As a result, we consider orthogonal-array-based latin...
متن کاملEmbeddings in Hypercubes
One important aspect of efficient use of a hypercube computer to solve a given problem is the assignment of subtasks to processors in such a way that the communication overhead is low. The subtasks and their inter-communication requirements can be modeled by a graph, and the assignment of subtasks to processors viewed as an embedding of the task graph into the graph of the hypercube network. We...
متن کاملLatin hypercube designs with controlled correlations and multi - dimensional stratification
Various methods have been proposed to construct Latin hypercube designs with small correlations. Orthogonal arrays have been used to construct Latin hypercube designs with multidimensional stratification. To integrate these two ideas, we propose a method to construct Latin hypercube designs with both controlled correlations and multi-dimensional stratification. For numerical integration, the co...
متن کامل